Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles
نویسندگان
چکیده
We consider the problem of deciding whether or not a geometric graph has a crossing-free spanning tree. This problem is known to be NP-hard even for very restricted types of geometric graphs. In this paper, we present an O(n) time algorithm to solve this problem for the special case of geometric graphs that arise as visibility graphs of a finite set of n points between two monotone polygonal obstacles. In addition, we give a combinatorial characterization of those visibility graphs induced by such obstacles that have a crossing-free spanning tree. As a byproduct, we obtain a family of counterexamples to the following conjecture by Rivera-Campo: A geometric graph has a crossing-free spanning tree if every subgraph obtained by removing a single vertex has a crossing-free spanning tree.
منابع مشابه
Geometric Data Structures and Their Selected Applications
Finding the shortest path between two positions is a fundamental problem in transportation, routing, and communications applications. In robot motion planning, the robot should pass around the obstacles touching none of them, i.e. the goal is to find a collision-free path from a starting to a target position. This task has many specific formulations depending on the shape of obstacles, allowabl...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملLower bounds on the maximum number of non-crossing acyclic graphs
This paper is a contribution to the problem of counting geometric graphs on point sets. More concretely, we look at the maximum numbers of non-crossing spanning trees and forests. We show that the so-called double chain point configuration of N points has Ω(12.52 ) noncrossing spanning trees and Ω(13.61 ) non-crossing forests. This improves the previous lower bounds on the maximum number of non...
متن کاملOn Minimum Average Stretch Spanning Trees in Polygonal 2-Trees
A spanning tree of an unweighted graph is a minimum average stretch spanning tree if it minimizes the ratio of sum of the distances in the tree between the end vertices of the graph edges and the number of graph edges. We consider the problem of computing a minimum average stretch spanning tree in polygonal 2-trees, a super class of 2-connected outerplanar graphs. For a polygonal 2-tree on n ve...
متن کامل